critical graph
英 [ˈkrɪtɪkl ɡræf]
美 [ˈkrɪtɪkl ɡræf]
网络 临界图
双语例句
- The critical group of a graph is a refinement of the number of spanning trees of the graph.
图的临界群是图的生成树数目的一个加细。 - The minimum critical set is the most important information that network attack graph shows.
分析攻击图分析中求解攻击图最小关键集的方法和作用。 - On the Total-Colourable Critical Graph
全着色临界图 - Study of Paraffin Critical Parameter by Graph Theory
用图论方法研究饱和烷烃的临界参数 - Numbers of critical domination for a graph
图的控制临界数 - A Problem Concerning With the Chromatic-index Critical Graph
关于边着色临界图的一个问题 - Critical activity execution structures are analyzed based on the frequent graph pattern mining technology, supporting the quality management process control and improvement.
提出了基于频繁图模式挖掘的工作流频繁活动序列分析的方法，分析了质量管理过程中的关键活动链结构，辅助质量管理过程控制和改进。 - In this artical, a kind of method of composition is given by which, the big arboricity critical graph is constructed from a little one.
给出了由较小的荫度临界图构造较大的荫度临界图的一种合成的方法。 - An Algorithm for Finding the Critical Path of Loop Dependence Graph
求循环体相关图关键路径的算法 - A Critical Graph for the Class of Three Connected Cubic Graphs
3-连通3次图类的（2,1）&临界图 - The critical graph is connected and of class two and G-e is class one for any edge e of graph G.
临界图是连通的第二类图，而且对于G的任意一条边e，G-e是第一类图。 - An algorithm for seeking the critical paths in the overall planning graph
统筹图中求关键路线的一个算法 - On isolated toughness and fractional ( a, b; n)-critical graph
孤立韧度与分数（a，b；n）-临界图 - In order to determine whether exist chromatic index critical graph of order 14, we should determine chromatic index critical of order 13 at first.
要想确定是否存在14阶色指数临界图，首先需要确定出13阶临界图的结构和特征。这篇论文的主要目的就是确定所有的13阶色指数临界图。 - Construction of Arboricity Critical Graph
荫度临界图的构造法 - The edge size of critical-graph
临界图的边数 - An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O ( n 3). The theory, which the algorithm depends on, is verified in detail.
给出了1个求统筹图中关键路线的多项式算法，证明了该算法的理论依据，分析了它的复杂性为O（n3）。 - This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
论述了图论的技术以及项目管理技术，并且根据图论技术和项目管理技术设计出了关键路径算法以及网络图绘制算法。 - This paper provides another conclusion: G is a non-( n& 1)-chromatic elementary subgraph if and only if G is a n-edge critical graph. This result gives the construction of the n-edge critical graphs.
本文又得到一个结论：G是非n-1色基本子图当且仅当G是n-边临界图，从而给出了n-边临界图的构造。 - In this paper three sufficient conditions are given, which are degree condition and neighborhood condition for graph G to be an ( a, b, n)-critical graph.
本文给出了图是（a，b，n）临界图几个充分条件，即度和邻域条件。 - In this paper we gave four critical definitions about the chromatic index of a graph, and discussed the relations among them.
本文给出图的边色数的四种临界概念，并研究它们之间的相互关系。 - Some properties of the minimum critical graph
关于最小临界图的一些性质 - Its critical point is graphic elements 'characteristic extracting and graph matching, which is also served for the design of intelligence correction algorithm in theory.
其关键技术是图元特征提取与图形匹配，它为智能化批改的算法、设计与实现做了理论上的准备。 - A Note on the p Critical 2-Edge-Connected Graph
关于p阶临界2边连通图的一个注记 - On the construction of Δ-critical graph
关于Δ-临界图的构造 - Estimation on the number of non critical edges in n connected graph
估计n-连通图中非基本边的数目 - With the maze mapping method and the orthogonal mutually exclusive criterion of the critical trap grids, the optimized coding problem of CMG mechanism is transformed into that of vertex coloring problem in graph theory. It is revealed that the working principle of the lock mechanism is combinatorics.
采用迷宫映射方法和关键阱格点互斥的十字叉判据，将CMG机构的编码问题转换为图论中顶点着色问题，揭示了这种锁机构的组合数学原理。 - Taking failure randomicity and critical task running continuity into consideration and to achieve the rational scheduling of failed task, a critical task scheduling method based on Directed Acyclic Graph ( DAG) task reconstruction and migration is proposed with the principle of scheduling first, optimization after.
针对失效发生随机性以及关键任务运行连续性等特点，采用先调度，后优化的指导思想，提出了基于DAG任务重构迁移的关键任务调度方案。 - Secondly, as for the situation that overload critical line is outside transmission sections, an on-line method based on graph theory is further given to explore power flow transferring path set.
其次，针对过负荷关键线路位于输电断面外的情形，提出了一种基于图论的潮流转移路径集在线搜索方法。